<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<title>Disjoint Stable Set Problems - Formulations by Representatives and Combinatorial Solvers: OrderedSet&lt; T &gt;::Iterator Class Reference</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="dynsections.js"></script>
<link href="search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="search/search.js"></script>
<script type="text/javascript">
  $(document).ready(function() { searchBox.OnSelectItem(0); });
</script>
<link href="doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
 <tbody>
 <tr style="height: 56px;">
  <td style="padding-left: 0.5em;">
   <div id="projectname">Disjoint Stable Set Problems - Formulations by Representatives and Combinatorial Solvers
   </div>
  </td>
 </tr>
 </tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.8.1.1 -->
<script type="text/javascript">
var searchBox = new SearchBox("searchBox", "search",false,'Search');
</script>
  <div id="navrow1" class="tabs">
    <ul class="tablist">
      <li><a href="index.html"><span>Main&#160;Page</span></a></li>
      <li class="current"><a href="annotated.html"><span>Classes</span></a></li>
      <li><a href="files.html"><span>Files</span></a></li>
      <li>
        <div id="MSearchBox" class="MSearchBoxInactive">
        <span class="left">
          <img id="MSearchSelect" src="search/mag_sel.png"
               onmouseover="return searchBox.OnSearchSelectShow()"
               onmouseout="return searchBox.OnSearchSelectHide()"
               alt=""/>
          <input type="text" id="MSearchField" value="Search" accesskey="S"
               onfocus="searchBox.OnSearchFieldFocus(true)" 
               onblur="searchBox.OnSearchFieldFocus(false)" 
               onkeyup="searchBox.OnSearchFieldChange(event)"/>
          </span><span class="right">
            <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a>
          </span>
        </div>
      </li>
    </ul>
  </div>
  <div id="navrow2" class="tabs2">
    <ul class="tablist">
      <li><a href="annotated.html"><span>Class&#160;List</span></a></li>
      <li><a href="classes.html"><span>Class&#160;Index</span></a></li>
      <li><a href="inherits.html"><span>Class&#160;Hierarchy</span></a></li>
      <li><a href="functions.html"><span>Class&#160;Members</span></a></li>
    </ul>
  </div>
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
     onmouseover="return searchBox.OnSearchSelectShow()"
     onmouseout="return searchBox.OnSearchSelectHide()"
     onkeydown="return searchBox.OnSearchSelectKey(event)">
<a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(0)"><span class="SelectionMark">&#160;</span>All</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(1)"><span class="SelectionMark">&#160;</span>Classes</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(2)"><span class="SelectionMark">&#160;</span>Files</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(3)"><span class="SelectionMark">&#160;</span>Functions</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(4)"><span class="SelectionMark">&#160;</span>Variables</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(5)"><span class="SelectionMark">&#160;</span>Typedefs</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(6)"><span class="SelectionMark">&#160;</span>Enumerations</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(7)"><span class="SelectionMark">&#160;</span>Enumerator</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(8)"><span class="SelectionMark">&#160;</span>Friends</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(9)"><span class="SelectionMark">&#160;</span>Macros</a></div>

<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<iframe src="javascript:void(0)" frameborder="0" 
        name="MSearchResults" id="MSearchResults">
</iframe>
</div>

<div id="nav-path" class="navpath">
  <ul>
<li class="navelem"><a class="el" href="classOrderedSet.html">OrderedSet</a></li><li class="navelem"><a class="el" href="classOrderedSet_1_1Iterator.html">Iterator</a></li>  </ul>
</div>
</div><!-- top -->
<div class="header">
  <div class="summary">
<a href="#pub-methods">Public Member Functions</a>  </div>
  <div class="headertitle">
<div class="title">OrderedSet&lt; T &gt;::Iterator Class Reference</div>  </div>
</div><!--header-->
<div class="contents">

<p><code>#include &lt;<a class="el" href="OrderedSet_8h_source.html">OrderedSet.h</a>&gt;</code></p>
<div class="dynheader">
Inheritance diagram for OrderedSet&lt; T &gt;::Iterator:</div>
<div class="dyncontent">
<div class="center"><img src="classOrderedSet_1_1Iterator__inherit__graph.png" border="0" usemap="#OrderedSet_3_01T_01_4_1_1Iterator_inherit__map" alt="Inheritance graph"/></div>
<map name="OrderedSet_3_01T_01_4_1_1Iterator_inherit__map" id="OrderedSet_3_01T_01_4_1_1Iterator_inherit__map">
<area shape="rect" id="node3" href="classArrayvEBTree_1_1FilterIterator.html" title="ArrayvEBTree\&lt; long\l \&gt;::FilterIterator" alt="" coords="255,5,393,51"/><area shape="rect" id="node5" href="classArrayvEBTree_1_1Iterator.html" title="A generic iterator on the set of elements." alt="" coords="255,74,393,121"/><area shape="rect" id="node7" href="classvEBTree_1_1FilterIterator.html" title="vEBTree\&lt; long \&gt;::FilterIterator" alt="" coords="225,144,423,173"/><area shape="rect" id="node9" href="classvEBTree_1_1Iterator.html" title="A generic iterator on the set of elements." alt="" coords="239,197,409,227"/></map>
<center><span class="legend">[<a href="graph_legend.html">legend</a>]</span></center></div>

<p><a href="classOrderedSet_1_1Iterator-members.html">List of all members.</a></p>
<table class="memberdecls">
<tr class="heading"><td colspan="2"><h2><a name="pub-methods"></a>
Public Member Functions</h2></td></tr>
<tr class="memitem:ab669dc2ebf80e4dda8ba400f171ca5a8"><td class="memItemLeft" align="right" valign="top">virtual&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classOrderedSet_1_1Iterator.html#ab669dc2ebf80e4dda8ba400f171ca5a8">~Iterator</a> ()</td></tr>
<tr class="memdesc:ab669dc2ebf80e4dda8ba400f171ca5a8"><td class="mdescLeft">&#160;</td><td class="mdescRight">The destructor.  <a href="#ab669dc2ebf80e4dda8ba400f171ca5a8"></a><br/></td></tr>
<tr class="memitem:a6a9e51f69677e1a99ed26a82992c0774"><td class="memItemLeft" align="right" valign="top">virtual void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classOrderedSet_1_1Iterator.html#a6a9e51f69677e1a99ed26a82992c0774">start</a> ()=0</td></tr>
<tr class="memdesc:a6a9e51f69677e1a99ed26a82992c0774"><td class="mdescLeft">&#160;</td><td class="mdescRight">Start the enumeration.  <a href="#a6a9e51f69677e1a99ed26a82992c0774"></a><br/></td></tr>
<tr class="memitem:a1059b72a133c4d91db9d6b9dc6e9e25a"><td class="memItemLeft" align="right" valign="top">virtual void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classOrderedSet_1_1Iterator.html#a1059b72a133c4d91db9d6b9dc6e9e25a">restart</a> ()=0</td></tr>
<tr class="memdesc:a1059b72a133c4d91db9d6b9dc6e9e25a"><td class="mdescLeft">&#160;</td><td class="mdescRight">Restart the enumeration.  <a href="#a1059b72a133c4d91db9d6b9dc6e9e25a"></a><br/></td></tr>
<tr class="memitem:a549749c10272de6e849686efec0da6bd"><td class="memItemLeft" align="right" valign="top">virtual void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classOrderedSet_1_1Iterator.html#a549749c10272de6e849686efec0da6bd">restartFrom</a> (T i)=0</td></tr>
<tr class="memdesc:a549749c10272de6e849686efec0da6bd"><td class="mdescLeft">&#160;</td><td class="mdescRight">Restart the enumeration from a specified element.  <a href="#a549749c10272de6e849686efec0da6bd"></a><br/></td></tr>
<tr class="memitem:a6dcbbe8214c2ffe11e648c086b6da40e"><td class="memItemLeft" align="right" valign="top">virtual bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classOrderedSet_1_1Iterator.html#a6dcbbe8214c2ffe11e648c086b6da40e">hasNext</a> ()=0</td></tr>
<tr class="memdesc:a6dcbbe8214c2ffe11e648c086b6da40e"><td class="mdescLeft">&#160;</td><td class="mdescRight">Verify if the set has same element not enumerated yet.  <a href="#a6dcbbe8214c2ffe11e648c086b6da40e"></a><br/></td></tr>
<tr class="memitem:aa29b03e6eb8efddba53885693e92e31d"><td class="memItemLeft" align="right" valign="top">virtual T&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classOrderedSet_1_1Iterator.html#aa29b03e6eb8efddba53885693e92e31d">next</a> ()=0</td></tr>
<tr class="memdesc:aa29b03e6eb8efddba53885693e92e31d"><td class="mdescLeft">&#160;</td><td class="mdescRight">Enumerate the elements in the set.  <a href="#aa29b03e6eb8efddba53885693e92e31d"></a><br/></td></tr>
</table>
<hr/><h2>Constructor &amp; Destructor Documentation</h2>
<a class="anchor" id="ab669dc2ebf80e4dda8ba400f171ca5a8"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename T&gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">virtual <a class="el" href="classOrderedSet.html">OrderedSet</a>&lt; T &gt;::Iterator::~Iterator </td>
          <td>(</td>
          <td class="paramname"></td><td>)</td>
          <td></td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span><span class="mlabel">virtual</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p>The destructor. </p>
<p>A simple destructor. </p>

<p>Reimplemented in <a class="el" href="classvEBTree_1_1Iterator.html#a6a0a5ee2f938be39b3d7a534dc8358f1">vEBTree&lt; T &gt;::Iterator</a>, and <a class="el" href="classArrayvEBTree_1_1Iterator.html#a680777939650bf1bbe7acb53e4f82ab4">ArrayvEBTree&lt; T &gt;::Iterator</a>.</p>

</div>
</div>
<hr/><h2>Member Function Documentation</h2>
<a class="anchor" id="a6dcbbe8214c2ffe11e648c086b6da40e"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename T&gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">virtual bool <a class="el" href="classOrderedSet.html">OrderedSet</a>&lt; T &gt;::Iterator::hasNext </td>
          <td>(</td>
          <td class="paramname"></td><td>)</td>
          <td></td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">pure virtual</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p>Verify if the set has same element not enumerated yet. </p>
<p>Look in the set if same element was not enumerated each. The enumeration is represent by the call to the method <a class="el" href="classOrderedSet_1_1Iterator.html#aa29b03e6eb8efddba53885693e92e31d" title="Enumerate the elements in the set.">next()</a>. if a element of the set was a element return by <a class="el" href="classOrderedSet_1_1Iterator.html#aa29b03e6eb8efddba53885693e92e31d" title="Enumerate the elements in the set.">next()</a>, it was enumerated , otherwise it was not.</p>
<dl class="section return"><dt>Returns:</dt><dd>true if there is a element not enumerated in the set and false otherwise. </dd></dl>

<p>Implemented in <a class="el" href="classvEBTree_1_1FilterIterator.html#a249372c0ac4c5ed22fa6c4edf725179f">vEBTree&lt; T &gt;::FilterIterator</a>, <a class="el" href="classvEBTree_1_1Iterator.html#a1f02546ac829b1d49e60d53f15be2b8c">vEBTree&lt; T &gt;::Iterator</a>, <a class="el" href="classArrayvEBTree_1_1FilterIterator.html#accfed7e47b4c21d1bb189d2492930a36">ArrayvEBTree&lt; T &gt;::FilterIterator</a>, and <a class="el" href="classArrayvEBTree_1_1Iterator.html#a5f87c5e123eca5fa27bf58bb670ee88c">ArrayvEBTree&lt; T &gt;::Iterator</a>.</p>

</div>
</div>
<a class="anchor" id="aa29b03e6eb8efddba53885693e92e31d"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename T&gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">virtual T <a class="el" href="classOrderedSet.html">OrderedSet</a>&lt; T &gt;::Iterator::next </td>
          <td>(</td>
          <td class="paramname"></td><td>)</td>
          <td></td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">pure virtual</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p>Enumerate the elements in the set. </p>
<p>It will return the next element not visited yet by the <a class="el" href="classOrderedSet_1_1Iterator.html">Iterator</a>.</p>
<p>All the calls to <a class="el" href="classOrderedSet_1_1Iterator.html#aa29b03e6eb8efddba53885693e92e31d" title="Enumerate the elements in the set.">next()</a> must has done after a call to hasnext() and only must be care out if the hasnext() returns true.</p>
<p>Try to call <a class="el" href="classOrderedSet_1_1Iterator.html#aa29b03e6eb8efddba53885693e92e31d" title="Enumerate the elements in the set.">next()</a> when there is no element in the set not enumerated each will case a error.</p>
<dl class="section return"><dt>Returns:</dt><dd>the next element to be enumerate </dd></dl>

<p>Implemented in <a class="el" href="classvEBTree_1_1FilterIterator.html#a0eafee3aedf12f98a4a12bf6db2f6e1e">vEBTree&lt; T &gt;::FilterIterator</a>, <a class="el" href="classvEBTree_1_1Iterator.html#ad99580f47f78ad58fd84ab5c27f8d851">vEBTree&lt; T &gt;::Iterator</a>, <a class="el" href="classArrayvEBTree_1_1FilterIterator.html#aa9b8e11902a867e96a84d5700a006f9f">ArrayvEBTree&lt; T &gt;::FilterIterator</a>, and <a class="el" href="classArrayvEBTree_1_1Iterator.html#a15293b0382355e96ae1b45022937e535">ArrayvEBTree&lt; T &gt;::Iterator</a>.</p>

</div>
</div>
<a class="anchor" id="a1059b72a133c4d91db9d6b9dc6e9e25a"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename T&gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">virtual void <a class="el" href="classOrderedSet.html">OrderedSet</a>&lt; T &gt;::Iterator::restart </td>
          <td>(</td>
          <td class="paramname"></td><td>)</td>
          <td></td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">pure virtual</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p>Restart the enumeration. </p>
<p>This method start the enumeration again. Beware that all the current state of the object will be lost and the enumeration will begin again from the first element in the set according to the order in the universe. </p>

<p>Implemented in <a class="el" href="classvEBTree_1_1FilterIterator.html#a1d94b3c0371ada541db5d2c88427b415">vEBTree&lt; T &gt;::FilterIterator</a>, <a class="el" href="classvEBTree_1_1Iterator.html#a26d3031d2130e28684e6ab014700ad8e">vEBTree&lt; T &gt;::Iterator</a>, <a class="el" href="classArrayvEBTree_1_1FilterIterator.html#a81140313b88b17698b0c48ee6dc3e560">ArrayvEBTree&lt; T &gt;::FilterIterator</a>, and <a class="el" href="classArrayvEBTree_1_1Iterator.html#a9a5d39b750892c7451ce46c50ad00172">ArrayvEBTree&lt; T &gt;::Iterator</a>.</p>

</div>
</div>
<a class="anchor" id="a549749c10272de6e849686efec0da6bd"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename T&gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">virtual void <a class="el" href="classOrderedSet.html">OrderedSet</a>&lt; T &gt;::Iterator::restartFrom </td>
          <td>(</td>
          <td class="paramtype">T&#160;</td>
          <td class="paramname"><em>i</em></td><td>)</td>
          <td></td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">pure virtual</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p>Restart the enumeration from a specified element. </p>
<p>This method start the enumeration again. Beware that all the current state of the object will be lost.</p>
<p>The enumeration will begin again from the first element in the set bigger or equal to the specified element according to the order in the universe.</p>
<dl class="params"><dt>Parameters:</dt><dd>
  <table class="params">
    <tr><td class="paramname">i</td><td>the specified element </td></tr>
  </table>
  </dd>
</dl>

</div>
</div>
<a class="anchor" id="a6a9e51f69677e1a99ed26a82992c0774"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename T&gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">virtual void <a class="el" href="classOrderedSet.html">OrderedSet</a>&lt; T &gt;::Iterator::start </td>
          <td>(</td>
          <td class="paramname"></td><td>)</td>
          <td></td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">pure virtual</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p>Start the enumeration. </p>
<p>This method must be called before any call to hasnext() or <a class="el" href="classOrderedSet_1_1Iterator.html#aa29b03e6eb8efddba53885693e92e31d" title="Enumerate the elements in the set.">next()</a>. Otherwise a error will occur.</p>
<p>This method start the enumeration of the first element in the set </p>

<p>Implemented in <a class="el" href="classvEBTree_1_1FilterIterator.html#ae9b7eeeb2eb5569448b2f877604ec1ec">vEBTree&lt; T &gt;::FilterIterator</a>, <a class="el" href="classvEBTree_1_1Iterator.html#a3f18d015f489b36d8403af3a46311efb">vEBTree&lt; T &gt;::Iterator</a>, <a class="el" href="classArrayvEBTree_1_1FilterIterator.html#a863e95227e516d893ab343f4c2a848ba">ArrayvEBTree&lt; T &gt;::FilterIterator</a>, and <a class="el" href="classArrayvEBTree_1_1Iterator.html#a17bf7e111b3fdb99bc2736f6ebdb160e">ArrayvEBTree&lt; T &gt;::Iterator</a>.</p>

</div>
</div>
<hr/>The documentation for this class was generated from the following file:<ul>
<li>datastruct/<a class="el" href="OrderedSet_8h_source.html">OrderedSet.h</a></li>
</ul>
</div><!-- contents -->
<!-- start footer part -->
<hr class="footer"/><address class="footer"><small>
Generated on Tue Nov 6 2012 14:51:42 for Disjoint Stable Set Problems - Formulations by Representatives and Combinatorial Solvers by &#160;<a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/>
</a> 1.8.1.1
</small></address>
</body>
</html>
